A Coverage-Aware Distributed <i>k</i>-Connectivity Maintenance Algorithm for Arbitrarily Large <i>k</i> in Mobile Sensor Networks

Mobile sensor networks (MSNs) have emerged from the interaction between mobile robotics and wireless networks. MSNs can be deployed in harsh environments, where failures some nodes partition into disconnected network segments or reduce coverage area. A $k$ -connected tolerate at least -1 arbitrary node without losing its connectivity. In this study, we present a coverage-aware distributed -connectivity maintenance (restoration) algorithm that generates minimum-cost movements of active after failure to preserve persistent value subject conservation criterion. The accepts ratio (as trade-off parameter movements) facilitates with generated according value. Extensive simulations testbed experiments reveal proposed restores more efficiently than existing restoration algorithms. Furthermore, our utilized maintain sacrificing coverage, significantly.